DISCRETE APPROACHES FOR SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS USING NMR DATA

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Approaches for Solving Molecular Distance Geometry Problems Using Nmr Data

The molecular distance geometry problem (MDGP) is the problem of finding the conformation of a molecule by exploiting known distances between some pairs of its atoms. Estimates of the distances between the atoms can be obtained through experiments of nuclear magnetic resonance (NMR) spectroscopy. The information on the distances, however, is usually limited, because only distances between hydro...

متن کامل

Discrete Approaches for Solving Molecular Distance Geometry Problems Using Nmr Dta

The molecular distance geometry problem (MDGP) is the problem of finding the conformation of a molecule by exploiting known distances between some pairs of its atoms. Estimates of the distances between the atoms can be obtained through experiments of nuclear magnetic resonance (NMR) spectroscopy. The information on the distances, however, is usually limited, because only distances between hydro...

متن کامل

Solving molecular distance geometry problems by global optimization algorithms

In this paper we consider global optimization algorithms based on multiple local searches for the Molecular Distance Geometry Problem (MDGP). Three distinct approaches (Multistart, Monotonic Bain Hopping, Population Basin Hopping) are presented and for each of them a computational analysis is performed. The results are also compared with those of two other approaches in the literature, the DGSO...

متن کامل

A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data

Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate all other “missing” distances to build a full set of distances. However, the estimation step is costly and prone to introducing errors. In this report, we describe a geometric...

متن کامل

Solving distance geometry problems for protein structure determination

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii CHAPTER

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Bioscience

سال: 2010

ISSN: 1918-3909

DOI: 10.2316/j.2010.210-1025